identify every wordの例文
- If so instructed, computers can identify every word in a corpus by its part of speech, its location in a sentence, the words that surround it and its meaning ( for homographs and words with multiple definitions ).
- Then, " b " satisfies the " inner condition ", since the function \ varrho is the well-known bijection that identifies every word endomorphism with any such table . ( The repeated applications of such an endomorphism starting from a given " seed " word are able to model many growth processes, where words and concatenation serve to build fairly heterogeneous structures as in L-system, not just " sequences " .)